A Note on Column Subset Selection

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Column Subset Selection

Given a matrix U , using a deterministic method, we extract a "large" submatrix of Ũ (whose columns are obtained by normalizing those of U ) and estimate its smallest and largest singular value. We apply this result to the study of contact points of the unit ball with its maximal volume ellipsoid. We consider also the paving problem and give a deterministic algorithm to partition a matrix into ...

متن کامل

Column subset selection is NP-complete

Let M be a real r × c matrix and let k be a positive integer. In the column subset selection problem (CSSP), we need to minimize the quantity M − SA, where A can be an arbitrary k × c matrix, and S runs over all r × k submatrices of M. This problem and its applications in numerical linear algebra are being discussed for several decades, but its algorithmic complexity remained an open issue. We ...

متن کامل

Column Subset Selection with Missing Data

An important problem in massive data collection systems is to identify a representative subset of collection points from a given set of measurements. This problem is well cast in the literature as selecting representative columns from a low-rank data matrix. However, a challenge that arises immediately is that complete data are typically not available or are infeasible to collect in very large ...

متن کامل

A note on the ϵ-indicator subset selection

The -indicator subset selection selects a subset of a nondominated point set that is as close as possible to a reference point set with respect to the -indicator. This selection procedure is used by population-based heuristic approaches for multiobjective optimization problems. Given that this procedure is called very often during the run of the heuristic approach, efficient ways of computing t...

متن کامل

Optimal Column Subset Selection by A-Star Search

Approximating a matrix by a small subset of its columns is a known problem in numerical linear algebra. Algorithms that address this problem have been used in areas which include, among others, sparse approximation, unsupervised feature selection, data mining, and knowledge representation. Such algorithms were investigated since the 1960’s, with recent results that use randomization. The proble...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2013

ISSN: 1687-0247,1073-7928

DOI: 10.1093/imrn/rnt172